Improved Fully Polynomial time Approximation Scheme for the 0-1 Multiple-choice Knapsack Problem
نویسنده
چکیده
In this paper the 0-1 Multiple-Choice Knapsack Problem (0-1 MCKP), a generalization of the classical 0-1 Knapsack problem, is addressed. We present a fast Fully Polynomial Time Approximation Scheme (FPTAS) for the 0-1 MCKP, which yields a better time bound than known algorithms. In particular it produces a (1+ ) approximate solution and runs in O(nm/ ) time, where n is the number of items and m is the number of multiple-choice classes.
منابع مشابه
A New Fully Polynomial Approximation Scheme for the Knapsack Problem
A new fully polynomial approximation scheme (FPTAS) is presented for the classical 0{1 knapsack problem. It considerably improves the space requirements. The two best previously known approaches need O(n+1=" 3) and O(n1=") space, respectively. Our new approximation scheme requires only O(n + 1=" 2) space while also reducing the running time.
متن کاملOn Strong NP-Completeness of Rational Problems
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were assumed to be integers. We re-examine here the computational complexity of all these problems in the setting where the weights and profits are allowed to be...
متن کاملA Faster FPTAS for the Unbounded Knapsack Problem
The Unbounded Knapsack Problem (UKP) is a well-known variant of the famous 0-1 Knapsack Problem (0-1 KP). In contrast to 0-1 KP, an arbitrary number of copies of every item can be taken in UKP. Since UKP is NP-hard, fully polynomial time approximation schemes (FPTAS) are of great interest. Such algorithms find a solution arbitrarily close to the optimum OPT(I), i.e. of value at least (1− ε)OPT(...
متن کاملAn FPTAS for the parametric knapsack problem
In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued parameter. The aim is to provide a solution for all values of the parameter. It is well-known that any exact algorithm for the problemmay need to output an exponential number of knapsack solutions. We present a fully polynomial-time approximation scheme (FPTAS...
متن کاملApproximation Schemes for 0-1 Knapsack
We revisit the standard 0-1 knapsack problem. The latest polynomial-time approximation scheme by Rhee (2015) with approximation factor 1 + ε has running time near Õ(n+ (1/ε)5/2) (ignoring polylogarithmic factors), and is randomized. We present a simpler algorithm which achieves the same result and is deterministic. With more effort, our ideas can actually lead to an improved time bound near Õ(n...
متن کامل